"""
给定一个非空字符串 s 和一个包含非空单词的列表 wordDict，
判定 s 是否可以被空格拆分为一个或多个在字典中出现的单词。
说明：
拆分时可以重复使用字典中的单词。
你可以假设字典中没有重复的单词。

示例 1：
输入: s = "leetcode", wordDict = ["leet", "code"]
输出: true
解释: 返回 true 因为 "leetcode" 可以被拆分成 "leet code"。

示例 2：
输入: s = "applepenapple", wordDict = ["apple", "pen"]
输出: true
解释: 返回 true 因为 "applepenapple" 可以被拆分成 "apple pen apple"。
     注意你可以重复使用字典中的单词。

示例 3：
输入: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
输出: false

链接：https://leetcode-cn.com/problems/word-break
"""
import mode
from mode import TreeNode
from mode import List
from mode import collections


class Solution:
    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
        n = len(s)
        deque = collections.deque()
        wordSet = (wordDict)
        visited = [0] * n
        deque.append(0)

        while deque:
            cur = deque.popleft()
            if visited[cur]:
                continue
            else:
                visited[cur] = 1

            for j in range(cur, n):
                if s[cur:j + 1] in wordSet:
                    if j == n - 1:
                        return True
                    else:
                        deque.append(j + 1)
        return False


if __name__ == "__main__":
    # s = "leetcode"
    # wordDict = ["leet", "code"]
    # s = "abcd"
    # wordDict = ["a", "abc", "b", "cd"]
    s = "aaaaaaa"
    wordDict = ["aaaa", "aaa"]

    A = Solution()
    print(A.wordBreak(s, wordDict))
